On Optimal Blocking of Sequential Files
نویسندگان
چکیده
منابع مشابه
Non-blocking Writes to Files
Writing data to a page not present in the file-system page cache causes the operating system to synchronously fetch the page into memory first. Synchronous page fetch defines both policy (when) and mechanism (how), and always blocks the writing process. Non-blocking writes eliminate such blocking by buffering the written data elsewhere in memory and unblocking the writing process immediately. S...
متن کاملBatched Search of Index Sequential Files
The performance of batched search when applied to index sequential files is studied. Analysis provides exact formulae for the cost of searching when batching is applied as a function of the magnitude of the query and time. The analysis takes into account (a) accesses to the overflow area only, and (b) accesses to both primary and overflow area, as well as whether the records of the query are (a...
متن کاملBlocking for Sequential Political Experiments
In typical political experiments, researchers randomize a set of households, precincts, or individuals to treatments all at once, and characteristics of all units are known at the time of randomization. However, in many other experiments, subjects "trickle in" to be randomized to treatment conditions, usually via complete randomization. To take advantage of the rich background data that researc...
متن کاملFork Sequential Consistency is Blocking
We consider an untrusted server storing shared data on behalf of clients. We show that no storage access protocol can on the one hand preserve sequential consistency and wait-freedom when the server is correct, and on the other hand always preserve fork sequential consistency.
متن کاملBlocking Optimal Arborescences
The problem of covering minimum cost common bases of two matroids is NP-complete, even if the two matroids coincide, and the costs are all equal to 1. In this paper we show that the following special case is solvable in polynomial time: given a digraph D = (V,A) with a designated root node r ∈ V and arc-costs c : A → R, find a minimum cardinality subset H of the arc set A such that H intersects...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1984
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/27.4.321